Creating Clusters: An Analysis of Traveling Salesman as a Clustering Mechanism
نویسندگان
چکیده
It is May, 1940. The Germans have just taken control of the northwestern portions of France; the resistance has fled south to various villages. Many questions arise: how should they organize? How will they share resources? How will they communicate? If they form large groups over many cities, communications and supplies may take too long to arrive. If their groups are too small, they may not have enough resources to defend against an attack.
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملAn Effective Solution to Large-scale Traveling Salesman Problems Using Chaotic Neural Networks
This paper presents an effective TSP (Traveling Salesman Problem) solver for large-scale problems using neural networks. Firstly, in the proposed method, an intractable large-scale TSP is divided into some tractable small-scale problems (clusters) using a clustering technique. Secondly, a visiting order of clusters is determined using chaotic neural networks (CNNs). Thirdly, the small-scale pro...
متن کاملClustering Evolutionary Computation for Solving Travelling Salesman Problems
This paper proposes the methods for solving the traveling salesman problems using clustering techniques and evolutionary methods. Gaussian mixer model and K-means clustering are two clustering techniques that are considered in this paper. The traveling salesman problems are clustered in order to group the nearest nodes in the problems. Then, the evolutionary methods are applied to each cluster....
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کامل